Stability of Constant Retrial Rate Systems with NBU Input*
نویسندگان
چکیده
منابع مشابه
Sufficient stability conditions for multi-class constant retrial rate systems
We study multi-class retrial queueing systems with Poisson inputs, general service times, and an arbitrary numbers of servers and waiting places. A class-i blocked customer joins orbit i and waits in the orbit for retrial. Orbit i works like a single-server ·/M/1 queueing system with exponential retrial time regardless of the orbit size. Such retrial systems are referred to as retrial systems w...
متن کاملStability Analysis of GI/G/c/K Retrial Queue with Constant Retrial Rate
We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has c identical servers and can accommodate the maximal number of K jobs. If a newly arriving job finds the full primary queue, it joins the orbit. The original primary jobs arrive to the system according to a renewal process. The jobs have...
متن کاملStability of Retrial Queues with Versatile Retrial Policy
We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. F...
متن کاملConditions for stability and instability of retrial queueing systems with general retrial times
We study the stability of single server retrial queues under general distribution for retrial times and stationary ergodic service times, for three main retrial policies studied in the literature: classical linear, constant and control policies. The approach used is the renovating events approach to obtain sufficient stability conditions by strong coupling convergence of the process modeling th...
متن کاملRetrial Queueing System with Several Input Flows
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive repeated attempts of each customers from th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2016
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-016-2755-8